Cyclic matching sequencibility of graphs
نویسندگان
چکیده
We define the cyclic matching sequencibility of a graph to be the largest integer d such that there exists a cyclic ordering of its edges so that every d consecutive edges in the cyclic ordering form a matching. We show that the cyclic matching sequencibility of K2m and K2m+1 equals m− 1.
منابع مشابه
The r-Matching Sequencibility of Complete Graphs
Alspach [Bull. Inst. Combin. Appl., 52 (2008), pp. 7–20] defined the maximal matching sequencibility of a graph G, denoted ms(G), to be the largest integer s for which there is an ordering of the edges of G such that every s consecutive edges form a matching. Alspach also proved that ms(Kn) = ⌊ n−1 2 ⌋ . Brualdi et al. [Australas. J. Combin., 53 (2012), pp. 245–256] extended the definition to c...
متن کاملRemarks on Upper and Lower Bounds for Matching Sequencibility of Graphs
In 2008, Alspach [The Wonderful Walecki Construction, Bull. Inst. Combin. Appl. 52 (2008) 7–20] defined the matching sequencibility of a graph G to be the largest integer k such that there exists a linear ordering of its edges so that every k consecutive edges in the linear ordering form a matching of G, which is denoted by ms(G). In this paper, we show that every graph G of size q and maximum ...
متن کاملA note on the cyclic matching sequencibility of graphs
In this note we present answers to the open problems posed by Brualdi, Kiernan, Meyer and Schroeder in [Cyclic matching sequencibility of graphs, Australas. J. Combin. 53 (2012), 245–256]. 1 Discussion and response Let G ⊆ Kn be a graph of order n with m edges. The matching number of G is the maximum number of edges in a matching. The matching number of a linear ordering e1, e2, . . . , em of t...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملThe augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 53 شماره
صفحات -
تاریخ انتشار 2012